Monodromies of generic real algebraic functions
نویسندگان
چکیده
منابع مشابه
On Topological Invariants of Real Algebraic Functions
We consider a natural covering responsible for the complexity of the ramification of roots of the general real polynomial equation, and calculate the homology groups of its base; for equations of degree ≤ 5 we give a complete description of the topology of this base. The general complex d-valued entire algebraic function x = F (a1, . . . , ad), given by the equation (1) x + a1x + · · ·+ ad−1x+ ...
متن کاملAlgebraic Specialization of Generic Functions for Recursive Types
Defining functions over large, possibly recursive, data structures usually involves a lot of boilerplate. This code simply traverses non-interesting parts of the data, and rapidly becomes a maintainability problem. Many generic programming libraries have been proposed to address this issue. Most of them allow the user to specify the behavior just for the interesting bits of the structure, and p...
متن کاملMonodromies of Algebraic Connections on the Trivial Bundle
In this note, we study monodromies of algebraic connections on the trivial vector bundle. We prove that on a smooth complex affine curve, any monodromy arises as the underlying local system of an algebraic connection on the trivial bundle. We give a generalization of this for rank one monodromies in higher dimension. Monodromies des connexions algébriques sur le fibré trivial Résumé. Dans cette...
متن کاملOn the space of morphisms into generic real algebraic varieties
We introduce a notion of generic real algebraic variety and we study the space of morphisms into these varieties. Let Z be a real algebraic variety. We say that Z is generic if there exist a finite family {Di}i=1 of irreducible real algebraic curves with genus ≥ 2 and a biregular embedding of Z into the product variety Qn i=1 Di. A bijective map φ : e Z −→ Z from a real algebraic variety e Z to...
متن کاملAlgebraic Characterizations of Complexity-Theoretic Classes of Real Functions
Recursive analysis is the most classical approach to model and discuss computations over the real numbers. Recently, it has been shown that computability classes of functions in the sense of recursive analysis can be defined (or characterized) in an algebraic machine independent way, without resorting to Turing machines. In particular nice connections between the class of computable functions (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1999
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(98)00084-4